Parikh Matrices and Words over Tertiary Ordered Alphabet
نویسندگان
چکیده
Parikh matrix is a numerical property of a word on an ordered alphabet. It is used for studying word in terms of its sub words. It was introduced by Mateescu et al. in 2000. Since then it has been being studied for various ordered alphabets. In this paper Parikh Matrices over tertiary alphabet are investigated. Algorithm is developed to display Parikh Matrices of words over tertiary alphabet. This algorithm proves a good tool for further investigation of Parikh Matrices of words over tertiary alphabet. A set of equations for finding tertiary words from the respective Parikh matrix is introduced. These equations are useful to find tertiary words from the respective Parikh matrix. Examples are given. Some examples of larger tertiary words are given with their Parikh matrices as result analysis. A distance is defined on classes of Mambiguous words over tertiary ordered alphabet. It is named as stepping distance. One can compare words by this stepping distance.
منابع مشابه
A Matrix q-Analogue of the Parikh Map
We introduce an extension of the Parikh mapping called the Parikh -matrix mapping, which takes its values in matrices with polynomial entries. The morphism constructed represents a word over a -letter alphabet as a -dimensional upper-triangular matrix with entries that are nonnegative integral polynomials in variable . We show that by appropriately embedding the -letter alphabet into the -lette...
متن کاملA q-Matrix Encoding Extending the Parikh Matrix Mapping
We introduce a generalization of the Parikh mapping called the Parikh q-matrix encoding, which takes its values in matrices with polynomial entries. The encoding represents a word w over a k-letter alphabet as a (k + 1)-dimensional upper-triangular matrix with entries that are nonnegative integral polynomials in variable q. Putting q = 1, we obtain the morphism introduced by Mateescu, Salomaa, ...
متن کاملParikh Matrices and Strong M-Equivalence
Parikh matrices have been a powerful tool in arithmetizing words by numerical quantities. However, the dependence on the ordering of the alphabet is inherited by Parikh matrices. Strong M -equivalence is proposed as a canonical alternative to M -equivalence to get rid of this undesirable property. Some characterization of strong M -equivalence for a restricted class of words is obtained. Finall...
متن کاملOn Parikh Matrices
Mateescu et al (2000) introduced an interesting new tool, called Parikh matrix, to study in terms of subwords, the numerical properties of words over an alphabet. The Parikh matrix gives more information than the well-known Parikh vector of a word which counts only occurrences of symbols in a word. In this note a property of two words u, v, called “ratio property”, is introduced. This property ...
متن کاملStrong 2.t and Strong 3.t Transformations for Strong M-equivalence
Parikh matrices have been extensively investigated due to their usefulness in studying subword occurrences in words. Due to the dependency of Parikh matrices on the ordering of the alphabet, strong M-equivalence was proposed as an order-independent alternative to M-equivalence in studying words possessing the same Parikh matrix. This paper introduces and studies the notions of strong (2 · t) an...
متن کامل